Cache Sensitive Representation for Bsp Trees

A binary tree is a common data structure used in many branches of computer science. It is often used for solving various types of searching problems. In complexity analysis we usually abstract from the real implementation and derive easily the time complexity of traversal from the root of a balanced tree to any leaf in asymptotic time O(log(m)), where m is the number of leaves. In this paper we propose a new method for memory mapping of a binary tree aiming to improve spatial locality of data represented by binary tree and to decrease traversal complexity.